Another Co*cryption Method

نویسنده

  • Bruno Martin
چکیده

We consider the enciphering of a data stream while being compressed by a LZ algorithm. This has to be compared to the classical encryption after compression methods used in security protocols. Actually, most cryptanalysis techniques exploit patterns found in the plaintext to crack the cipher; compression techniques reduce these attacks. Our scheme is based on a LZ compression in which a Vernam cipher has been added. We make some security remarks by trying to measure its randomness with statistical tests. Such a scheme could be employed to increase the speed of security protocols and to decrease the computing power for mobile devices. Cryptography, compression, pseudo-random sequences, security.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Is Mpeg Encryption by Using Random List Instead of Zigzag Order Secure?

This paper discusses the problems of the MPEG video encryption algorithm by using random permutation list instead of zigzag order within the MPEG compression process. We show that 1) the en-cryption method causes a signiicant size increase of the MPEG video stream, hence defeats the purpose of compression, and 2) the encryption method can not withstand the known-plaintext attack, therefore, sho...

متن کامل

A Recursive Approximation Approach of non-iid Lognormal Random Variables Summation in Cellular Systems

Co-channel interference is a major factor in limiting the capacity and link quality in cellular communications. As the co-channel interference is modeled by lognormal distribution, sum of the co-channel interferences of neighboring cells is represented by the sum of lognormal Random Variables (RVs) which has no closed-form expression. Assuming independent, identically distributed (iid) RVs, the...

متن کامل

Derandomizing Approximate Quantum Encryption Derandomizing Approximate Quantum Encryption

There are two variants of this definition. An encryption scheme is called perfect if Eve learns zero information from the ciphertext, and approximate if Eve can learn some non-zero amount of information. A perfect encryption ensures that the distributions (density matrices) of ciphertexts corresponding to different messages are exactly identical, while an approximate scheme only requires that t...

متن کامل

Performance Evaluation of Block Encryption Algorithms on Core 2

1. Introduction This paper presents the high-speed software en-cryption technique, " bit-slice implementation, " on Intel's new Core 2 processor, which is its first mi-cro-architecture platform. Until now, the performance of leading-edge processors has been evaluated and compared by implementing encryption algorithms and various benchmark tests. From the standpoint of en-cryption implementation...

متن کامل

Investigation of effect of magnetic ordering on structural and electronic properties of double perovskites Sr2BWO6 (B = Co, Ni, Cu) using ab initio method

Structural and electronic properties of double perovskites Sr2BWO6 (B = Co, Ni, Cu)  were studied  for each of three magnetic configurations nonmagnetic, ferromagnetic, and antiferromagnetic by using density functional theory in generalized gradient approximations (GGA) and strong correlation correction (GGA + U). Due to magnetic transition from antiferromagnetic to nonmagnetic phase, an electr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0807.3277  شماره 

صفحات  -

تاریخ انتشار 2008